Graph-dense linear transformations
نویسندگان
چکیده
منابع مشابه
Towards Combining Dense Linear Order with Random Graph
In this paper we present our work in progress towards obtaining a Nelson-Oppen style combination for combining quantified theories, where each individual component theory admits quantifier elimination. We introduces the notion of good model for union theories, for which there exists a simple quantifier elimination scheme that uses the elimination procedures for individual component theories as ...
متن کاملLinear Graph Transformations on Spaces of Analytic Functions
Let H be a Hilbert space of analytic functions with multiplier algebra M(H), and let M = {(f, T1f...., Tn−1f) : f ∈ D} be an invariant graph subspace for M(H). Here n ≥ 2, D ⊆ H is a vector-subspace, Ti : D → H are linear transformations that commute with each multiplication operator Mφ ∈ M(H), and M is closed in H. In this paper we investigate the existence of nontrivial common invariant subsp...
متن کاملA linear-time algorithm for finding a complete graph minor in a dense graph
Let g(t) be the minimum number such that every graph G with average degree d(G) ≥ g(t) contains a Kt-minor. Such a function is known to exist, as originally shown by Mader. Kostochka and Thomason independently proved that g(t) ∈ Θ(t√log t). This article shows that for all fixed ǫ > 0 and fixed sufficiently large t ≥ t(ǫ), if d(G) ≥ (2 + ǫ)g(t) then we can find this Kt-minor in linear time. This...
متن کاملDense & Sparse Graph Partition
In a graph G = (V, E), the density is the ratio between the number of edges |E| and the number of vertices |V |. This criterion may be used to find communities in a graph: groups of highly connected vertices. We propose an optimization problem based on this criterion, the idea is to find the vertex partition that maximizes the sum of the densities of each class. We prove that this problem is NP...
متن کاملLinear Transformations
The n×m matrix AT obtained by exchanging rows and columns of A is called the transpose of A. A matrix A is said to be symmetric if A = AT . The sum of two matrices of equal size is the matrix of the entry-by-entry sums, and the scalar product of a real number a and an m× n matrix A is the m× n matrix of all the entries of A, each multiplied by a. The difference of two matrices of equal size A a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1979
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1979.82.371